Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm for Combinatorial Path Planning: The Subtour Problem
The purpose of this paper is to present a combinatorial planner for autonomous systems. The approach is demonstrated on the so-called subtour problem, a variant of the classical traveling salesman problem TSP : given a set of n possible goals/targets, the optimal strategy is sought that connects k ≤ n goals. The proposed solution method is a Genetic Algorithm coupled with a heuristic local sear...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملA Genetic-Algorithm-Based Approach to UAV Path Planning Problem
This paper presents a genetic-algorithm-based approach to the problem of UAV path planning in dynamic environments. Variable-length chromosomes and their genes have been used for encoding the problem. We model the vehicle path as a sequence of speed and heading transitions occurring at discrete times, and this model specifically contains the vehicle dynamic constraints in the generation of tria...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2011
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2011/483643